- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by F. B. Cannonito
11 found
Order:
- Rado T.. On non-computable functions. The Bell System technical journal, vol. 41 , pp. 877–884.F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
- Kent Clement F.. Constructive analogues of the group of permutations of the natural numbers. Transactions of the American Mathematical Society, vol. 104 , pp. 347–362. [REVIEW]F. B. Cannonito - 1969 - Journal of Symbolic Logic 34 (3):517-518.
- Mayoh B. H.. Groups and semigroups with solvable word problems. Proceedings of the American Mathematical Society, vol. 18 , pp. 1038–1039. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
- Review: A. Wlodzimierz Mostowski, On the Decidability of Some Problems in Special Classes of Groups; A. Wlodzimierz Mostowski, Computational Algorithms for Deciding Some Problems for Nilpotent Groups. [REVIEW]F. B. Cannonito - 1970 - Journal of Symbolic Logic 35 (3):476-477.
- Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
- Review: Clement F. Kent, Constructive Analogues of the Group of Permutations of the Natural Numbers. [REVIEW]F. B. Cannonito - 1969 - Journal of Symbolic Logic 34 (3):517-518.
- Review: S. Tennenbaum, Degree of Unsolvability and the Rate of Growth of Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.Export citation
Bookmark - Rado Tibor. On a simple source for non-computable functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 75–81. [REVIEW]F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
- Review: T. Rado, On Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.Export citation Bookmark
- Review: Tibor Rado, On a Simple Source for Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.Export citation Bookmark
- Włodzimierz Mostowski A.. On the decidability of some problems in special classes of groups. Fundamenta mathematicae, vol. 59 , pp. 123–135.Włodzimierz Mostowski A.. Computational algorithms for deciding some problems for nilpotent groups. Fundamenta mathematicae, vol. 59 , pp. 137–152. [REVIEW]F. B. Cannonito - 1970 - Journal of Symbolic Logic 35 (3):476-477.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-c9g8x uwo